Recursive Approach in Sparse Matrix LU Factorization
نویسندگان
چکیده
منابع مشابه
Recursive approach in sparse matrix LU factorization
This paper describes a recursive method for the LU factorization of sparse matrices. The recursive formulation of common linear algebra codes has been proven very successful in dense matrix computations. An extension of the recursive technique for sparse matrices is presented. Performance results given here show that the recursive approach may perform comparable to leading software packages for...
متن کاملSparse LU factorization on the CRAY T3D
The paper describes a parallel algorithm for the LU fac-torization of sparse matrices on distributed memory machines by using SPMD as programming model and PVM as message passing interface. We address all the diiculties arising in sparse codes, as the ll-in or the dynamic movement of data inside the matrix. The cyclic distribution has been used to evenly distribute the elements onto a mesh of p...
متن کاملElimination Forest Guided D Sparse LU Factorization
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high perfor mance for this problem is di cult on distributed memory machines Our previous work has developed an approach called S that incorporates static symbolic factorization supernode partitioning and graph scheduling This paper studies the properties of elimination forests and uses the...
متن کاملParallel Symbolic Factorization for Sparse LU Factorization with Static Pivoting
In this paper we consider a direct method to solve a sparse unsymmetric system of linear equations Ax = b, which is the Gaussian elimination. This elimination consists in explicitly factoring the matrix A into the product of L and U , where L is a unit lower triangular matrix, and U is an upper triangular matrix, followed by solving LUx = b one factor at a time. One of the main characteristics ...
متن کاملSparse Matrix Factorization
We investigate the problem of factoring a matrix into several sparse matrices and propose an algorithm for this under randomness and sparsity assumptions. This problem can be viewed as a simplification of the deep learning problem where finding a factorization corresponds to finding edges in different layers and also values of hidden units. We prove that under certain assumptions on a sparse li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 2001
ISSN: 1058-9244,1875-919X
DOI: 10.1155/2001/569670